A general language-based framework for specifying and verifying notions of opacity

Opacity is an information flow property that captures the notion of plausible deniability in dynamic systems, whether intruder can deduce "secret" behavior has occurred. In this paper we provide a general framework opacity to unify many existing notions exist for discrete event systems. We use discuss language-based and state-based over automata. present several methods verification, approach transform into ones. demonstrate current-state initial-state opacity, unifying results. then investigate K-step opacity. view encompassing two new analyze corresponding verification both formally with numerical examples. each case, proposed offer significant reductions runtime space complexity.